Disjunctive Quantum Logic in Dynamic Perspective
نویسنده
چکیده
In Coecke (2002a) we proposed the intuitionistic or disjunctive representation of quantum logic, i.e., a representation of the property lattice of physical systems as a complete Heyting algebra of logical propositions on these properties, where this complete Heyting algebra goes equipped with an additional operation, the operational resolution, which identifies the properties within the logic of propositions. This representation has an important application “towards dynamic quantum logic”, namely in describing the temporal indeterministic propagation of actual properties of physical systems. This paper can as such by conceived as an addendum to “Quantum Logic in Intuitionistic Perspective” that discusses spin-off and thus provides an additional motivation. We derive a quantaloidal semantics for dynamic disjunctive quantum logic and illustrate it for the particular case of a perfect (quantum) measurement.
منابع مشابه
Quantum computation from a quantum logical perspective
It is well-known that Shor’s factorization algorithm, Simon’s period-finding algorithm, and Deutsch’s original XOR algorithm can all be formulated as solutions to a hidden subgroup problem. Here the salient features of the informationprocessing in the three algorithms are presented from a different perspective, in terms of the way in which the algorithms exploit the non-Boolean quantum logic re...
متن کاملMulti-paradigm Logic Programming
A disjunctive temporal logic programming language, called Disjunctive Chronolog is presented in this paper. Disjunctive Chronolog combines the ideas of both temporal logic programming and disjunctive logic programming. The new language is capable of expressing dynamic behaviour as well as uncertainty, two notions that are very common in a variety of real systems. Minimal model semantics, model ...
متن کاملComplete Lattices Represent Complete Heyting Algebras (or: Quantum Logic with an Intuitionistic Implication)
Via the introduction of (infinitary) disjunctions on any complete lattice while inheriting the meet as a conjunction, we construct a bijective correspondence (up to isomorphism) between complete lattices L and complete Heyting algebras DI(L) equipped with a so called disjunctive join dense closure operator RL. If L is itself a complete Heyting algebra then DI(L) ∼= L and RL = idDI(L). Ortholatt...
متن کاملPlan Synthesis: A Logical Perspective
This paper explores some theoretical issues of robot system planning from the perspective of propositional dynamic logic. A generalized notion of "progression" and "regression" of conditions through actions Is developed. This leads to a bidirectional single-level planning algorithm that Is easily extended to hierarchical planning. Multiple pre-/postcondition pairs, complex (e.g., conjunctive, d...
متن کاملFree Choice for Simplification
The fact that counterfactuals in general license simplification of disjunctive antecedents is a familiar problem for the traditional Lewis-Stalnaker variably strict analysis of counterfactuals. This paper demonstrates that the data are well explained by a dynamic strict analysis of counterfactuals that uses ideas from the inquisitive semantic tradition to provide a satisfying semantic explanati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Studia Logica
دوره 71 شماره
صفحات -
تاریخ انتشار 2002